Nuprl Lemma : disjoint_sublists_sublist
4,23
postcript
pdf
T
:Type,
L1
,
L2
,
L
:
T
List. disjoint_sublists(
T
;
L1
;
L2
;
L
)
{
L1
L
&
L2
L
}
latex
Definitions
x
:
A
.
B
(
x
)
,
i
j
,
||
as
||
,
{
i
..
j
}
,
t
T
,
P
Q
,
False
,
A
,
A
B
,
,
l
[
i
]
,
Prop
,
S
T
,
S
T
,
increasing(
f
;
k
)
,
P
&
Q
,
x
:
A
.
B
(
x
)
,
{
T
}
,
L1
L2
,
disjoint_sublists(
T
;
L1
;
L2
;
L
)
Lemmas
disjoint
sublists
wf
,
increasing
wf
,
int
seg
wf
,
select
wf
,
length
wf1
,
non
neg
length
origin
T:Type, L1, L2, L:T List. disjoint_sublists(T;L1;L2;L) 
{L1 
L & L2 L} T:Type, L1, L2, L:T List. disjoint_sublists(T;L1;L2;L) {L1 L & L2 L} x:A. B(x)
j
}
T Q
A
B
T
T
x:A. B(x) L2